21![Numbers, constants and computation 1 Numerical evaluation of the Riemann Zeta-function Numbers, constants and computation 1 Numerical evaluation of the Riemann Zeta-function](https://www.pdfsearch.io/img/d69c7d34091090bba7bbae71554f3144.jpg) | Add to Reading ListSource URL: wiskunde.vandelden.netLanguage: English - Date: 2010-04-15 08:54:48
|
---|
22![To appear in Neural Computation Methods for Binary Multidimensional Scaling Douglas L. T. Rohde School of Computer Science, Carnegie Mellon University, and the Center for the Neural Basis of Cognition To appear in Neural Computation Methods for Binary Multidimensional Scaling Douglas L. T. Rohde School of Computer Science, Carnegie Mellon University, and the Center for the Neural Basis of Cognition](https://www.pdfsearch.io/img/af8a7b7c7e6f183e8253d0535acba9b3.jpg) | Add to Reading ListSource URL: tedlab.mit.eduLanguage: English - Date: 2012-08-07 12:32:37
|
---|
23![MATHEMATICS OF COMPUTATION SArticle electronically published on February 15, 2002 CLASS NUMBERS OF REAL CYCLOTOMIC FIELDS OF PRIME CONDUCTOR MATHEMATICS OF COMPUTATION SArticle electronically published on February 15, 2002 CLASS NUMBERS OF REAL CYCLOTOMIC FIELDS OF PRIME CONDUCTOR](https://www.pdfsearch.io/img/9fdff1ffdcada625407e1585abf93b6e.jpg) | Add to Reading ListSource URL: www.mat.uniroma2.itLanguage: English - Date: 2002-11-22 18:43:22
|
---|
24![Graph Isomorphism is in SPP ? V. Arvind ∗ and Piyush P Kurur 1 Institute of Mathematical Sciences, Chennai, India Abstract We show that Graph Isomorphism is in the complexity class SPP, and hence it is Graph Isomorphism is in SPP ? V. Arvind ∗ and Piyush P Kurur 1 Institute of Mathematical Sciences, Chennai, India Abstract We show that Graph Isomorphism is in the complexity class SPP, and hence it is](https://www.pdfsearch.io/img/76f912bd72b33f44930e0dff3414ccc7.jpg) | Add to Reading ListSource URL: www.cse.iitk.ac.inLanguage: English - Date: 2016-07-30 09:35:21
|
---|
25![Steve Warner Curriculum Vitae Department of Mathematics Hofstra University Hempstead, NY 11549 Steve Warner Curriculum Vitae Department of Mathematics Hofstra University Hempstead, NY 11549](https://www.pdfsearch.io/img/e12d6b1f2b47fb5c3ebbb5974e43a176.jpg) | Add to Reading ListSource URL: satprepget800.comLanguage: English - Date: 2016-06-13 13:02:27
|
---|
26![Theory of Evolutionary Algorithms Benjamin Doerr1 and Carola Doerr2 1École Polytechnique, Paris-Saclay, France 2CNRS and Université Pierre et Marie Curie, Paris, France Theory of Evolutionary Algorithms Benjamin Doerr1 and Carola Doerr2 1École Polytechnique, Paris-Saclay, France 2CNRS and Université Pierre et Marie Curie, Paris, France](https://www.pdfsearch.io/img/769fe8afce4b77df6b90e07750fa9680.jpg) | Add to Reading ListSource URL: www.wcci2016.orgLanguage: English - Date: 2016-06-10 00:18:56
|
---|
27![Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡ Martin J. Straussk Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡ Martin J. Straussk](https://www.pdfsearch.io/img/4b305e1aa3c292b2c758c49b6d6ccfbd.jpg) | Add to Reading ListSource URL: cs-www.cs.yale.eduLanguage: English - Date: 2006-09-25 10:55:42
|
---|
28![On the Complexity of Universality for Partially Ordered NFAs∗ Markus Krötzsch1 , Tomáš Masopust2 , and Michaël Thomazo3 1 Institute of Theoretical Computer Science and Center of Advancing On the Complexity of Universality for Partially Ordered NFAs∗ Markus Krötzsch1 , Tomáš Masopust2 , and Michaël Thomazo3 1 Institute of Theoretical Computer Science and Center of Advancing](https://www.pdfsearch.io/img/4a53b06389573e0ab34d5a00abc84383.jpg) | Add to Reading ListSource URL: korrekt.orgLanguage: English - Date: 2016-06-13 07:14:39
|
---|
29![Powerpoint-presentation Information and Computing Sciences Powerpoint-presentation Information and Computing Sciences](https://www.pdfsearch.io/img/418c401703b1a252ede3f7156ab7ba10.jpg) | Add to Reading ListSource URL: usefulpatterns.orgLanguage: English - Date: 2015-04-25 08:23:03
|
---|
30![CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time](https://www.pdfsearch.io/img/be06d1d6787d6b33cbcfc32fc4e3a3c3.jpg) | Add to Reading ListSource URL: theory.stanford.eduLanguage: English - Date: 2014-01-06 16:13:01
|
---|